| class WTD_DIGRAPH{NTP<$STR,WTP<$NUMBER{WTP}} < $LBLD_DIGRAPH{NTP,WTP,WTP} |
|---|
| **** | A standard directed graph with node and edge weights of type WTP. The nodes of the graph are of type NTP. |
| $LBLD_DIGRAPH{_,_,_} | $DIGRAPH{_} | $RO_DIGRAPH{_} | $GRAPH{_,_} | $STR | $ELT{_} | $ELT | LBLD_DIGRAPH{_,_,_} | LBLD_DIGRAPH_INCL{_,_,_} | DIGRAPH{_} | $SUPPORTS_REHASH | DIGRAPH_INCL{_} | RO_DIGRAPH_INCL{_} | COMPARE{_} |
| bellman_ford(s:NTP, out d:MAP{NTP,WTP}, out |
|---|
| **** | Call into the digraph algorithm class |
| dijkstra(src:NTP,out dist:MAP{NTP,WTP},out |
|---|
| **** | Call into the digraph algorithm class |
| max_weight_path_node!(once src,once sink: NTP): NTP |
|---|
| **** | Please see the comment at WTD_DIGRAPH_ALG{_,_,_,_}::max_weight_path |